A new simple homotopy algorithm for linear programming I

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Linear Programming, the Simplex Algorithm and Simple Polytopes

In the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. In the second part we discuss some recent developments concurring the simplex algorithm. We describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes. 

متن کامل

A Simple Homotopy Algorithm for Compressive Sensing

In this paper, we consider the problem of recovering the s largest elements of an arbitrary vector from noisy measurements. Inspired by previous work, we develop an homotopy algorithm which solves the l1-regularized least square problem for a sequence of decreasing values of the regularization parameter. Compared to the previous method, our algorithm is more efficient in the sense it only updat...

متن کامل

A simple introduction to Karmarkar's Algorithm for Linear Programming

An extremely simple, description of Karmarkar’s algorithm with very few technical terms is given.

متن کامل

A Very Simple Polynomial - Time Algorithm for Linear Programming

In this note we propose a polynomial-time algorithm for linear programming. This algorithm augments the objective by a logarithmic penalty function and then solves a sequence of quadratic approximations of this program. This algorithm has a complexity of O(ml/2 -L) iterations and O(m 3 .5.L) arithmetic operations, where m is the number of variables and L is the size of the problem encoding in b...

متن کامل

linear programming, the simplex algorithm and simple polytopes

in the first part of the paper we survey some far reaching applications of the basis facts of linear programming to the combinatorial theory of simple polytopes. in the second part we discuss some recent developments concurring the simplex algorithm. we describe sub-exponential randomized pivot roles and upper bounds on the diameter of graphs of polytopes.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Complexity

سال: 1988

ISSN: 0885-064X

DOI: 10.1016/0885-064x(88)90025-8